Correction to: On How to Not Prove Faulty Controllers Safe in Differential Dynamic Logic

How to Prove Higher Order Theorems in First Order Logic

In this paper we are interested in using a first order theorem prover to prove theorems that are formulated in some higher order logic. To this end we present translations of higher order logics into first order logic with flat sorts and equality and give a sufficient criterion for the soundness of these translations. In addition translations are introduced that are sound and complete with resp...

How Not to Prove the Poincar E Conjecture

How Not to Prove the Alon-tarsi Conjecture

The sign of a Latin square is −1 if it has an odd number of rows and columns that are odd permutations; otherwise, it is +1. Let Ln and L o n be, respectively, the number of Latin squares of order n with sign +1 and −1. The Alon-Tarsi conjecture asserts that Ln = Ln when n is even. Drisko showed that Lp+1 ≡ Lp+1 (mod p) for prime p ≥ 3 and asked if similar congruences hold for orders of the for...

3 How to Prove Important

In this paper, we show that a variety of important philosophical claims that Saul Kripke has advanced in his work are either provable in, or validated by, the theory of abstract objects (hereafteròbject theory'). 1 We'll investigate both metaphysical claims and claims concerning language which appear in Kripke's work. To establish that one of Kripke's metaphysical claims is provable in object t...

How To Prove Theorems Formally